Reoptimization Approaches for the Vehicle Routing Problem with Stochastic Demands Nicola Secomandi, Francois Margot Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA, US

Source URL: wpweb2.tepper.cmu.edu

o. Univ. Prof. Dr. Richard Hartl Fakultät für Wirtschaftswissenschaften VORTRAG The split delivery vehicle routing problem

Source URL: prolog.univie.ac.at

A Framework for Routing Systems in the Supply Chain Including: The Structure of Vehicle Routing Problems Rainer Barthels, Liechtenstein University of Applied Sciences Siegfried Weinmann, Liechtenstein University of Appli

Source URL: www.strc.ch

• Operations research
• NP-complete problems
• Vehicle routing problem
• Routing
• Supply chain

Vehicle Routing for a Complex Waste Collection Problem Iliya Markov, Ecole Polytechnique Fédérale de Lausanne Sacha Varone, Haute Ecole de Gestion de Genève Michel Bierlaire, Ecole Polytechnique Fédérale de Lausanne

Source URL: www.strc.ch

• NP-complete problems
• Operations research
• Vehicle routing problem
• Travelling salesman problem
• Applied mathematics
• Mathematics
• Variable neighborhood search
• Partition problem
• Heuristic
• Simulated annealing
• Theoretical computer science

Comput Optim Appl:463–487 DOIs10589z Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers Prasanna Balaprakash · Mauro Birattari ·

Source URL: code.ulb.ac.be

The Vehicle Routing Problem with Discrete Split Delivery and Time Windows Ilaria Vacca Matteo Salani STRC 2009

Source URL: www.strc.ch

• Operations research
• Mathematical optimization
• Numerical analysis
• Mathematics
• NP-complete problems
• Vehicle routing problem
• Dynamic programming
• Column generation
• Optimization problem
• XTR
• DantzigWolfe decomposition

Comparing Transit on Demand and the current standard of mass transit Key words: transportation sustainability, mass transit, intelligent transit, transit-ondemand, demand-responsive transport, vehicle routing problem, dy

Source URL: grad.uc.edu

Exploiting symmetries in logistics distribution planning

Source URL: www.mssanz.org.au

• NP-complete problems
• Analysis of algorithms
• Algorithm
• Mathematical logic
• Travelling salesman problem
• Logistics
• Symmetry in mathematics
• Time complexity
• Vehicle routing problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

INFORMS TRANSPORTATION SCIENCE Vol. 00, No. 0, Xxxxx 0000, pp. 000–000 issn | eissn | 00 | 0000 | 0001

Source URL: tbenoist.pagesperso-orange.fr

• Mathematics
• NP-complete problems
• Supply chain management
• Marketing
• Heuristics
• Inventory
• Vehicle routing problem
• Travelling salesman problem
• Heuristic function
• Business
• Theoretical computer science
• Operations research

On the Capacitated Vehicle Routing Problem∗ T.K. Ralphs†, L. Kopman‡, W.R. Pulleyblank§, and L.E. Trotter, Jr.¶ Revised December 17, 2001 Abstract We consider the Vehicle Routing Problem, in which a fixed fleet o

Source URL: coral.ie.lehigh.edu

• Applied mathematics
• Convex optimization
• Relaxation
• Linear programming
• Travelling salesman problem
• Lagrangian relaxation
• Simplex algorithm
• Mathematical optimization
• Operations research
• Mathematics